Successive Galerkin Approximation of the Isaacsequation
نویسندگان
چکیده
The successive Galerkin approximation (SGA) algorithm has recently been developed for approximating solutions to the Hamilton-Jacobi-Isaacs equation. The algorithm produces feedback control laws that are stabilizing on a well-deened region of state space. The objective of this paper is to demonstrate the application of the SGA algorithm to two simple examples. The examples serve several purposes: rst they illustrate how the algorithm is applied in a setting that is simple enough to write out in detail, second they demonstrate the convergence of the algorithm in a setting where the actual solution can be derived analytically.
منابع مشابه
Nonlinear Optimal Control Techniques Applied to a Launch Vehicle Autopilot
This paper presents an application of the nonlinear optimal control techniques to the design of launch vehicle autopilots. The optimal control is given by the solution to the Hamilton-Jacobi-Bellman (HJB) equation, which in this case cannot be solved explicity. A method based upon Successive Galerkin Approximation (SGA), is used to obtain an approximate optimal solution. Simulation results invo...
متن کاملA Novel Successive Approximation Method for Solving a Class of Optimal Control Problems
This paper presents a successive approximation method (SAM) for solving a large class of optimal control problems. The proposed analytical-approximate method, successively solves the Two-Point Boundary Value Problem (TPBVP), obtained from the Pontryagin's Maximum Principle (PMP). The convergence of this method is proved and a control design algorithm with low computational complexity is present...
متن کاملSuccessive Galerkin Approximation of Nonlinear Optimal Attitude Control
This paper presents the application of the Successive Galerkin Approximation (SGA) to the Hamilton-Jacobi-Bellman equation to obtain solutions of the optimal attitude control problem. Galerkin's method approximates the value function by a truncated Galerkin series expansion. To do so a truncated Galerkin basis set is formed. A suucient number of functions must be included in this Galerkin basis...
متن کاملNonlinear Robust Missile Autopilot Design Using Successive Galerkin Approximation
The application of a new nonlinear robust control strategy to the design of missile autopilots is presented. The control approach described and demonstrated here is based upon the numerical solution of the Hamilton-Jacobi-Isaacs equation by Successive Galerkin Approximation. Using this approach, feedback controllers are computed by an iterative application of a numerical Galerkin-type PDE solve...
متن کاملA meshless discrete Galerkin method for solving the universe evolution differential equations based on the moving least squares approximation
In terms of observational data, there are some problems in the standard Big Bang cosmological model. Inflation era, early accelerated phase of the evolution of the universe, can successfully solve these problems. The inflation epoch can be explained by scalar inflaton field. The evolution of this field is presented by a non-linear differential equation. This equation is considered in FLRW model...
متن کامل